#include"heap.h"
int main()
{
	int a[] = { 2,5,3,7,8,4,9};
	Heap hp;
	HeapInit(&hp);
	int i = 0;
	for ( i = 0; i < sizeof(a)/sizeof(int); i++)
	{
		HeapPush(&hp, a[i]);

	}
	HeapPrintf(&hp);

	HeapPop(&hp);

	HeapPrintf(&hp);
	
	printf("堆的元素个数有%d\n", HeapSize(&hp));
	printf("堆顶元素为%d", GetHeapTop(&hp));
	HeapDestroyed(&hp);
	return 0;
}